Timestamp Acknowledgments for Determining Message Stability

نویسندگان

  • K. Berket
  • R. Koch
  • L. E. Moser
  • P. M. Melliar-Smith
چکیده

Determination of message stability is important for multicast group communication systems, both for assuring applications that messages have been delivered and also for message buffer management. We present a protocol for determining message stability that uses a single scalar timestamp to acknowledge messages from many sources. The protocol avoids the linear growth in the acknowledgment size that occurs with vector acknowledgment protocols. Compared to other protocols, the protocol consumes significantly less network bandwidth, and its latency to the determination of message stability is only slightly larger. Synchronized physical clocks are shown to yield lower latency than logical clocks. We also present a simple connection establishment and group membership protocol for use in conjunction with the message stability protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient, IP based Solution to the ’Logical Timestamp Wrapping’ Problem

The order of events occurring at different nodes of a network can be critical in distributed systems [2]. As the synchronization of physical clocks with an acceptable accuracy is often infeasible in large networks, Lamport [5] introduced logical timestamps for message based systems. A prerequisite for ordering events is the encapsulation of timestamps into every sent message (i.e. timestamp wra...

متن کامل

Timestamps and authentication protocols

Timestamp-based authentication and key establishment protocols have received a number of criticisms, despite their potential efficiency advantages. The purpose of this paper is to propose a novel timestamp management method which has the potential to increase the scope of applicability of such protocols. Since timestamp-based protocols typically involve one less message than challenge-response ...

متن کامل

Saving Redundant Messages in BnB-ADOPT

We have found that some messages of BnB-ADOPT are redundant. Removing most of those redundant messages we obtain BnB-ADOPT, which achieves the optimal solution and terminates. In practice, BnBADOPT causes substantial reductions on communication costs with respect to the original algorithm. BnB-ADOPT (Yeoh, Felner, and Koenig 2008) is a reference algorithm for distributed constraint optimization...

متن کامل

Identifying Conversational Message Threads by Integrating Classification and Data Clustering

Conversational message thread identification regards a wide spectrum of applications, ranging from social network marketing to virus propagation, digital forensics, etc. Many different approaches have been proposed in literature for the identification of conversational threads focusing on features that are strongly dependent on the dataset. In this paper, we introduce a novel method to identify...

متن کامل

RFC 6622 ICV and Timestamp TLVs for MANETs

This document describes general and flexible TLVs for representing cryptographic Integrity Check Values (ICVs) (i.e., digital signatures or Message Authentication Codes (MACs)) as well as timestamps, using the generalized Mobile Ad Hoc Network (MANET) packet/message format defined in RFC 5444. It defines two Packet TLVs, two Message TLVs, and two Address Block TLVs for affixing ICVs and timesta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998